#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
#include <math.h>
#include <queue>
#include <vector>
#include "fastsort.h"
#include "first_num.h"
using namespace std;

priority_queue<int> sort_vec(vector<int>&data){
    std::priority_queue<int> result;
    for(auto e:data){
        result.push(e);
    }
    return result;
}

int main() {
    /* Enter your code here. Read input from STDIN. Print output to STDOUT */
//    vector<int>a = {1,6,2,4,8,3,5,7};
    vector<int>a = {5,3,9,4,6,8,2,1,2,2,2,2,2,2};
    cout<<first_num(a);
    return 0;
}
